2QBF: Challenges and Solutions
نویسندگان
چکیده
2QBF is a special form ∀x∃y.φ of the quantified Boolean formula (QBF) restricted to only two quantification layers, where φ is a quantifier-free formula. Despite its restricted form, it provides a framework for a wide range of applications, such as artificial intelligence, graph theory, synthesis, etc. In this work, we overview two main 2QBF challenges in terms of solving and certification. We contribute several improvements to existing solving approaches and study how the corresponding approaches affect certification. We further conduct an extensive experimental comparison on both competition and application benchmarks to demonstrate strengths of the proposed methodology.
منابع مشابه
Clauses Versus Gates in CEGAR-Based 2QBF Solving
2QBF is a special case of general quantified Boolean formulae (QBF). It is limited to just two quantification levels, i.e., to a form ∀X∃Y.φ. Despite this limitation it applies to a wide range of applications, e.g., to artificial intelligence, graph theorysynthesis, etc.. Recent research showed that CEGAR-based methodsgive a performance boost to QBF solving (e.g, compared to QDPLL). Conjunctive...
متن کاملA Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as instances of 2QBF. Techniques that are not applicable to general QBF evaluation may be useful for 2QBF evaluation. In particular, decision order in search based algorithms may not obey quantification order for 2QBF evalua...
متن کاملASPQ: An ASP-Based 2QBF Solver
Answer Set Programming (ASP) is an established logic-based programming paradigm which has been successfully applied for solving complex problems. Since ASP can model problems up to the second level of the polynomial hierarchy, it can be used to model and solve the 2QBF problem. In this paper we show how to obtain a fairly effective 2QBF solver by just resorting to state-of-the-art ASP solvers.
متن کاملAbstraction-Based Algorithm for 2QBF
ion-Based Algorithm for 2QBF Mikoláš Janota and Joao Marques-Silva 1 University College Dublin, Ireland 2 INESC-ID, Lisbon, Portugal Abstract. Quantified Boolean Formulas (QBFs) enable standard representation of PSPACE problems. In particular, formulas with two quantifier levels (2QBFs) enable representing problems in the second level of the polynomial hierarchy (Π 2 , Σ 2 ). This paper propose...
متن کاملA survey on impact of cloud computing security challenges on NFV infrastructure and risks mitigation solutions
Increased broadband data rate for end users and the cost of resource provisioning to an agreed SLA in telecom service providers, are forcing operators in order to adhere to employment Virtual Network Functions (VNF) in an NFV solution. The newly 5G mobile telecom technology is also based on NFV and Software Define Network (SDN) which inherit opportunities and threats of such constructs. Thus a ...
متن کامل